Powerdomains and zero finding
نویسندگان
چکیده
منابع مشابه
L-domains and Lossless Powerdomains
The category of L-domains was discovered by A. Jung while solving the problem of nding maximal cartesian closed categories of algebraic CPO's and continuous functions. In this note we analyse properties of the lossless powerdo-main construction, that is closed on the algebraic L-domains. The powerdomain is shown to be isomorphic to a collection of subsets of the domain on which the construction...
متن کاملConvex Powerdomains I
A completion via Frink ideals is used to define a convex powerdomain of an arbitrary continuous lattice as a continuous lattice. The powerdomain operator is a functor in the category of continuous lattices and continuous inf-preserving maps and preserves projective limits and surjectivity of morphisms; hence one can solve domain equations in which it occurs. Analogous results hold for algebraic...
متن کاملAlgebraic Characterization of Edible Powerdomains
Powerdomains like mixes, sandwiches, snacks and scones are typically used to provide semantics of collections of descriptions of partial data. In particular, they were used to give semantics of databases with partial information. In this paper we argue that to be able to put these constructions into the context of a programming languages it is necessary to characterize them as free (ordered) al...
متن کاملPredicate Transformers for Convex Powerdomains
We investigate laws for predicate transformers for the combination of nondeterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended nonnegative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to convex powerdomains, the appropriate powerdomains for the combin...
متن کاملMixed powerdomains for probability and nondeterminism
We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equational theories; we establish functional representation theorems; and we show equivalencies between state transformers and appropriately healthy predicate transformers. The extended nonnegative reals serve as ‘truth-values’. As usual with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00287-7